Single item lot-sizing with non-decreasing capacities

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single item lot-sizing with non-decreasing capacities

We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, constant unit production costs and non-negative unit holding costs), and ii) the production set-up costs are non-increasing over time, it is known that the minimum cost lotsizing problem is polynomially solvable using dyna...

متن کامل

The single-item lot-sizing problem with immediate lost sales

e introduce a profit maximization version of the well-known Wagner-Whitin model for the deterministic uncapacitated single-item lot-sizing problem with lost sales. Demand cannot be backlogged, but it does not have to be satisfied, either. Costs and selling prices are assumed to be time-variant, differentiating our model from previous models with lost sales. Production quantities and levels of l...

متن کامل

A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows

This paper deals with the single-item capacitated lot sizing problem with concave production and storage costs, considering minimum order quantity and dynamic time windows. This problem models a lot sizing where the production lots are constrained in amount and frequency. In this problem, a demand must be satisfied at each period t over a planning horizon of T periods. This demand can be satisf...

متن کامل

Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)

This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...

متن کامل

Multi-item dynamic lot-sizing with delayed transportation policy

We optimize ordering and inbound shipment decisions for a manufacturer that sources multiple items from a single supplier. The objective is to satisfy the requirements in the production plan with minimum transportation and inventory holding costs over a multi-period planning horizon. Transportation costs are charged to the manufacturer on a per truck shipment basis. We investigate the option of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2008

ISSN: 0025-5610,1436-4646

DOI: 10.1007/s10107-008-0228-7